skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Pollack, Paul"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Abstract Schinzel and Wójcik have shown that for every$$\alpha ,\beta \in \mathbb {Q}^{\times }\hspace{0.55542pt}{\setminus }\hspace{1.111pt}\{\pm 1\}$$ α , β Q × \ { ± 1 } , there are infinitely many primespwhere$$v_p(\alpha )=v_p(\beta )=0$$ v p ( α ) = v p ( β ) = 0 and where$$\alpha $$ α and$$\beta $$ β generate the same multiplicative group modp. We prove a weaker result in the same direction for algebraic numbers$$\alpha , \beta $$ α , β . Let$$\alpha , \beta \in \overline{\mathbb {Q}} ^{\times }$$ α , β Q ¯ × , and suppose$$|N_{\mathbb {Q}(\alpha ,\beta )/\mathbb {Q}}(\alpha )|\ne 1$$ | N Q ( α , β ) / Q ( α ) | 1 and$$|N_{\mathbb {Q}(\alpha ,\beta )/\mathbb {Q}}(\beta )|\ne 1$$ | N Q ( α , β ) / Q ( β ) | 1 . Then for some positive integer$$C = C(\alpha ,\beta )$$ C = C ( α , β ) , there are infinitely many prime idealsPof Equation missing<#comment/>where$$v_P(\alpha )=v_P(\beta )=0$$ v P ( α ) = v P ( β ) = 0 and where the group$$\langle \beta \bmod {P}\rangle $$ β mod P is a subgroup of$$\langle \alpha \bmod {P}\rangle $$ α mod P with$$[\langle \alpha \bmod {P}\rangle \,{:}\, \langle \beta \bmod {P}\rangle ]$$ [ α mod P : β mod P ] dividingC. A key component of the proof is a theorem of Corvaja and Zannier bounding the greatest common divisor of shiftedS-units. 
    more » « less
  2. Abstract We provide a uniform bound on the partial sums of multiplicative functions under very general hypotheses. As an application, we give a nearly optimal estimate for the count of$$n \le x$$for which the Alladi–Erdős function$$A(n) = \sum_{p^k \parallel n} k p$$takes values in a given residue class moduloq, whereqvaries uniformly up to a fixed power of$$\log x$$. We establish a similar result for the equidistribution of the Euler totient function$$\phi(n)$$among the coprime residues to the ‘correct’ moduliqthat vary uniformly in a similar range and also quantify the failure of equidistribution of the values of$$\phi(n)$$among the coprime residue classes to the ‘incorrect’ moduli. 
    more » « less
  3. Abstract Let denote the exponent of the multiplicative group modulon. We show that whenqis odd, each coprime residue class moduloqis hit equally often by asnvaries. Under the stronger assumption that , we prove that equidistribution persists throughout a Siegel–Walfisz‐type range of uniformity. By similar methods we show that obeys Benford's leading digit law with respect to natural density. Moreover, if we assume Generalized Riemann Hypothesis, then Benford's law holds for the order ofamodn, for any fixed integer . 
    more » « less